#include <cassert>  // assert
#include <iostream> // cin, cout, endl, ios_base, istream, ostream
#include <cmath>  // sqrt

#ifdef TEST
        #include "cppunit/TestSuite.h"      // TestSuite
        #include "cppunit/TextTestRunner.h" // TestRunner
        #include "cppunit/CompilerOutputter.h"  // CompilerOutputter
#endif // TEST

#ifdef ONLINE_JUDGE
        // turn off asserts
        #define NDEBUG
#endif

// global constants

/// @brief the possible maximum input number
const int MAX_INPUT_NUMBER = 10000000;

/// @brief sqrt of MAX_INPUT_NUMBER
const int SQRT_MAX_INPUT_NUMBER = 3162;

/// @brief all primes less than SQRT_MAX_INPUT_NUMBER
const int PRIMES[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137};

/// @brief size of PRIMES[] array
const int PRIMES_ARRAY_SIZE = sizeof(PRIMES) / sizeof(PRIMES[0]);

// global variables

/// @brief the input number
int i;
/// @brief an output value, true if it is impossible to find 4 primes, false otherwise.
bool is_impossible;
/// @brief the third prime to output
int v1;
/// @brief the fourth prime to output
int v2;

/**
 * @brief read an integer to global variable i
 * @param in the istream to read from
 * @return true if more integers are avalible, false otherwise.
 */
bool read (std::istream& in) {
	assert(in);
	in >> i;
	if (in) {
		return true;
	}
	return false;
}

/**
 * @brief print 4 primes that are found or "Impossible.\n" if no such
 *        primes exist
 * @param out the ostream to print to
 */
void print (std::ostream& out) {
	if (is_impossible) {
		out << "Impossible.\n";
		return;
	}
	if (i & 1) {
		out << "2 3 ";
	} else {
		out << "2 2 ";
	}
	
	out << v1 << " " << v2 << "\n";
}

/**
 * @brief use a binary search to check whether the number is in a prime array.
 * @pre n is a possitive integer, start_idx and end_idx is not out of boundary
 * @post return true if n is found in the array, false otherwise.
 * @param n the number to search
 * @param start_idx starting index to search
 * @param end_idx ending index to search
 * @return true if n is found in PRIMES array, false otherwise.
 */
bool bisearch(int n, int start_idx, int end_idx) {
	assert(n > 0);
	assert(start_idx >= 0);
	assert(end_idx < PRIMES_ARRAY_SIZE);

	if (start_idx > end_idx) {
		return false;
	}
	if (start_idx == end_idx) {
		if (PRIMES[start_idx] == n) {
			return true;
		} else {
			return false;
		}
	}

	// start_idx < end_idx
	int middle = (end_idx + start_idx) / 2;
	if (PRIMES[middle] == n) {
		return true;
	}
	if (PRIMES[middle] < n) {
		return bisearch(n, middle + 1, end_idx);
	}
	//PRIMES[middle] > n
	return bisearch(n, start_idx, middle - 1);
}

/**
 * @brief test whether a given number is a prime
 * @pre n is a possitive integer no greater than MAX_INPUT_NUMBER
 * @post return true if n is a prime, false otherwise.
 * @return true if n is a prime, false otherwise.
 */
bool is_prime(int n) {
	assert(n > 0);
	assert(n <= MAX_INPUT_NUMBER);
	if ((n != 3) && (n % 3 == 0)) {
		return false;
	}
	if ((n != 5) && (n % 5 == 0)) {
		return false;
	}
		
/* Because we check these (n%2, n%3, n%5 and n%7) right off the bat,
 * we do not need to check PRIMES[0] through PRIMES[3].  Start the 
 * for loop at i = 4.  Binary search starts at index 1 since [0] (prime 2) has
 * already been taken care of.
 */

	if (n <= SQRT_MAX_INPUT_NUMBER) {
		return bisearch(n, 0, PRIMES_ARRAY_SIZE - 1);
	}

	int sqrt_n = (int)sqrt(n);
	for (int i = 3; i < PRIMES_ARRAY_SIZE; i++) {
		if (n % PRIMES[i] == 0) {
			return false;
		}
		if (PRIMES[i] > sqrt_n) {
			break;
		}
	}
	return true;
}

/**
 * @brief find two primes which sum to n, store them in v1 and v2
 * @pre n is an even positive integer
 * @post v1 and v2 are two primes, and n = v1 + v2
 */
void find_last_two_prime(const int n) {
	assert(n > 0);
	assert((n & 1) == 0);

	if (n == 4) {
		v1 = 2;
		v2 = 2;
		return;
	}

	// when one prime is from the PRIMES array
	for (int i = 1; i < PRIMES_ARRAY_SIZE; i++) {
		v1 = PRIMES[i];
		v2 = n - v1;
		if (is_prime(v2)) {
			return;
		}
	}

	// no prime is from the PRIMES array
	// TODO add a prime cache.
	do {
		v1 = PRIMES[PRIMES_ARRAY_SIZE - 1] + 2;
		if (is_prime(v1)) {
			v2 = n - v1;
			#ifndef NDEBUG
			if (v2 < PRIMES[PRIMES_ARRAY_SIZE - 1]) {
				assert(false);
			}
			#endif
			if (is_prime(v2)) {
				return;
			}
		}
		v1 += 2;
	} while (true);
		
}

/**
 * @brief evaluate one input, find 4 primes or set is_impossible flag
 * @pre i is a positive integer.
 * @post is_impossible set to true if the input number can't be split to 4 primves.
 *       otherwise, set v1 and v2 to two primes which are the third and fourth prime.
 */
void eval () {
	is_impossible = false;
	
	if (i < 8) {
		is_impossible = true;
		return;
	}

	// see print() for why
	if (i & 1) {
		find_last_two_prime(i - 2 - 3);
	} else {
		find_last_two_prime(i - 2 - 2);
	}

	#ifndef NDEBUG
	assert(v1 >= 2);
	assert(v2 >= 2);
	assert(is_prime(v1));
	assert(is_prime(v2));
	
	if (i & 1) {
		assert(i == 2 + 3 + v1 + v2);
	} else {
		assert(i == 2 + 2 + v1 + v2);
	}
	#endif
}

#ifdef TEST
        // TODO include your testcase file here
        #include "TestPrimes.h"
#endif // TEST

int main () {
	using namespace std;
	ios_base::sync_with_stdio(false); // turn off synchronization with C I/O
	
        #ifdef TEST
		// ----------
		// unit tests
		// ----------

	        CppUnit::TextTestRunner tr;
		tr.addTest(TestPrimes::suite());
		
	        CppUnit::CompilerOutputter *outputter = new CppUnit::CompilerOutputter(&tr.result(), std::cerr);
	        outputter->setLocationFormat("%p:%l:");
	        tr.setOutputter(outputter);

		tr.run();
        #else

		// -------
		// program
		// -------

		//markprimes();
		
		while (read(cin)) {
			for (int i = 0; i < 2000; i++) {
				eval();
			}
			print(cout);
		}

        #endif // TEST
	
	return 0;
}


// Local Variables:
// truncate-lines: t
// End:
